A Note on Column Subset Selection
نویسنده
چکیده
Given a matrix U , using a deterministic method, we extract a "large" submatrix of Ũ (whose columns are obtained by normalizing those of U ) and estimate its smallest and largest singular value. We apply this result to the study of contact points of the unit ball with its maximal volume ellipsoid. We consider also the paving problem and give a deterministic algorithm to partition a matrix into almost isometric blocks recovering previous results of Bourgain-Tzafriri and Tropp. Finally, we partially answer a question raised by Naor about finding an algorithm in the spirit of Batson-Spielman-Srivastava’s work to extract a "large" square submatrix of "small" norm.
منابع مشابه
Provably Correct Algorithms for Matrix Column Subset Selection with Selectively Sampled Data
We consider the problem of matrix column subset selection, which selects a subset of columns from an input matrix such that the input can be well approximated by the span of the selected columns. Column subset selection has been applied to numerous real-world data applications such as population genetics summarization, electronic circuits testing and recommendation systems. In many applications...
متن کاملProvably Correct Active Sampling Algorithms for Matrix Column Subset Selection with Missing Data
We consider the problem of matrix column subset selection, which selects a subset of columns from an input matrix such that the input can be well approximated by the span of the selected columns. Column subset selection has been applied to numerous real-world data applications such as population genetics summarization, electronic circuits testing and recommendation systems. In many applications...
متن کاملColumn Subset Selection with Missing Data via Active Sampling
Column subset selection of massive data matrices has found numerous applications in real-world data systems. In this paper, we propose and analyze two sampling based algorithms for column subset selection without access to the complete input matrix. To our knowledge, these are the first algorithms for column subset selection with missing data that are provably correct. The proposed methods work...
متن کاملNumerical Study of Progressive Collapse in Framed Structures: A New Approach for Dynamic Column Removal (TECHNICAL NOTE)
Progressive collapse is a situation where local failure of a primary structural component leads to the collapse of adjoining members which, in turn, leads to additional collapse. Hence, the total damage is disproportionate to the original cause. The most common local failure in framed structure is assumed to be column failure. In this paper, a new approach for dynamic column removal in framed s...
متن کاملGreedy Representative Selection for Unsupervised Data Analysis
In recent years, the advance of information and communication technologies has allowed the storage and transfer of massive amounts of data. The availability of this overwhelming amount of data stimulates a growing need to develop fast and accurate algorithms to discover useful information hidden in the data. This need is even more acute for unsupervised data, which lacks information about the c...
متن کامل